Efficient Decentralized LTL Monitoring Framework Using Tableau Approach
نویسنده
چکیده
The paper proposes a novel framework for decentralized monitoring of Linear Temporal Logic (LTL), under the situation where processes are synchronous, uniform, and fully interconnected and the formula is represented as a tableau. In the proposed framework, processes can propagate messages containing truth values of atomic formulas, compound formulas, and temporal formulas depending on the syntactic structure of the formula being monitored, the observation power of the processes, and the truth values of the propositions in the global LTL formula being monitored. The paper also develops a tableau-based algorithm that allows processes to derive at each state the minimal set of formulas whose truth values need to be propagated. Finally, the paper compares static monitoring approaches that combine round-robin schemes with tableau technique to dynamic monitoring approaches that combine LTL formulaprogression technique with tableau technique, and draw several interesting conclusions about their performance and usability.
منابع مشابه
D4M, a Self-Adapting Decentralized Derived Data Collection and Monitoring Framework
Peer-to-peer systems are evolving as a viable distributed resource sharing paradigm on the Internet. The trend is growing towards the usage of such decentralized systems because they are more scalable and resource efficient than centralized systems. Current decentralized systems, like peer-to-peer networks, lack functionality to adapt the transmission of certain information artifacts, according...
متن کاملLTL Semantic Tableaux and Alternating $\omega$-automata via Linear Factors
Linear Temporal Logic (LTL) is a widely used specification framework for linear time properties of systems. The standard approach for verifying such properties is by transforming LTL formulae to suitable ω-automata and then applying model checking. We revisit Vardi’s transformation of an LTL formula to an alternating ω-automaton and Wolper’s LTL tableau method for satisfiability checking. We ob...
متن کاملLeviathan: A New LTL Satisfiability Checking Tool Based on a One-Pass Tree-Shaped Tableau
The paper presents Leviathan, an LTL satisfiability checking tool based on a novel one-pass, treelike tableau system, which is way simpler than existing solutions. Despite the simplicity of the algorithm, the tool has performance comparable in speed and memory consumption with other tools on a number of standard benchmark sets, and, in various cases, it outperforms the other tableau-based tools.
متن کاملA traditional tree-style tableau for LTL
Propositional linear time temporal logic (LTL) is the standard temporal logic for computing applications and many reasoning techniques and tools have been developed for it. Tableaux for deciding satisfiability have existed since the 1980s. However, the tableaux for this logic do not look like traditional tree-shaped tableau systems and their processing is often quite complicated. We present a n...
متن کاملA New Rule for LTL Tableaux
Propositional linear time temporal logic (LTL) is the standard temporal logic for computing applications and many reasoning techniques and tools have been developed for it. Tableaux for deciding satisfiability have existed since the 1980s. However, the tableaux for this logic do not look like traditional tree-shaped tableau systems and their processing is often quite complicated. In this paper,...
متن کامل